1 S ep 2 00 5 Counting unlabelled toroidal graphs with no K 3 , 3 - subdivisions Andrei Gagarin , Gilbert Labelle and Pierre Leroux
نویسنده
چکیده
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and projectiveplanar graphs containing no K3,3-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
منابع مشابه
Counting unlabelled toroidal graphs with no K33-subdivisions
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and projectiveplanar graphs containing no K3,3-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
متن کاملThe structure of K3, 3-subdivision-free toroidal graphs
We describe the structure of 2-connected non-planar toroidal graphs with no K3,3-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on a refinement of the algorithmic results for graphs containing a fixed K5-subdivision in [A. Gagarin and W. Kocay, “Embedding graphs containing K5-subdivisions”...
متن کاملStructure and enumeration of two-connected graphs with prescribed three-connected components
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-components of g (3-connected components or polygons) and black vertices are bonds a...
متن کاملThe obstructions for toroidal graphs with no K3, 3's
We prove a precise characterization of toroidal graphs with no K3,3-subdivisions in terms of forbidden minors and subdivisions. The corresponding lists of four forbidden minors and eleven forbidden subdivisions are shown.
متن کاملForbidden minors and subdivisions for toroidal graphs with no K3, 3's
Forbidden minors and subdivisions for toroidal graphs are numerous. In contrast, the toroidal graphs with no K3,3’s have a nice explicit structure and short lists of obstructions. For these graphs, we provide the complete lists of four forbidden minors and eleven forbidden subdivisions.
متن کامل